Inequalities for Finite Group Permutation Modules
نویسندگان
چکیده
If f is a nonzero complex-valued function defined on a finite abelian group A and f̂ is its Fourier transform, then | supp(f)|| supp(f̂)| ≥ |A|, where supp(f) and supp(f̂) are the supports of f and f̂ . In this paper we generalize this known result in several directions. In particular, we prove an analogous inequality where the abelian group A is replaced by a transitive right G-set, where G is an arbitrary finite group. We obtain stronger inequalities when the G-set is primitive, and we determine the primitive groups for which equality holds. We also explore connections between inequalities of this type and a result of Chebotarëv on complex roots of unity, and we thereby obtain a new proof of Chebotarëv’s theorem.
منابع مشابه
QUASI-PERMUTATION REPRESENTATIONS OF METACYCLIC 2-GROUPS
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fa...
متن کاملPermutation Presentations of Modules over Finite Groups
We introduce a notion of permutation presentations of modules over finite groups, and completely determine finite groups over which every module has a permutation presentation. To get this result, we prove that every coflasque module over a cyclic p-group is permutation projective.
متن کاملThe functor of p-permutation modules for abelian groups
Let k be a field of characteristic p, where p is a prime number, let ppk(G) be the Grothendieck group of p-permutation kG-modules, where G is a finite group, and let C ppk(G) = C ⊗Z ppk(G). In this article, we find all the composition factors of the biset functor C ppk restricted to the category of abelian groups.
متن کاملMILP models and valid inequalities for the two-machine permutation flowshop scheduling problem with minimal time lags
In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We propose two mixed-integer linear programming (MILP) models and two types of valid inequalities which aim t...
متن کاملOn the Doubly Transitive Permutation Representations of Sp(2n,F2)
Each symplectic group over the field of two elements has two exceptional doubly transitive actions on sets of quadratic forms on the defining symplectic vector space. This paper studies the associated 2-modular permutation modules. Filtrations of these modules are constructed which have subquotients which are modules for the symplectic group over an algebraically closed field of characteristic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005